On deflation for symmetric tridiagonal matrices
نویسنده
چکیده
K.V. Fernando developed an efficient approach for computation of an eigenvector of a tridiagonal matrix corresponding to an approximate eigenvalue. We supplement Fernando’s method with deflation procedures by Givens rotations. These deflations can be used in the Lanczos process and instead of the inverse iteration.
منابع مشابه
Inner deflation for symmetric tridiagonal matrices
Suppose that one knows an accurate approximation to an eigenvalue of a real symmetric tridiagonal matrix. A variant of deflation by the Givens rotations is proposed in order to split off the approximated eigenvalue. Such a deflation can be used instead of inverse iteration to compute the corresponding eigenvector. © 2002 Elsevier Science Inc. All rights reserved.
متن کاملHomotopy algorithm for the symmetric diagonal-plus-semiseparable eigenvalue problem
A dense symmetric matrix can be reduced into a similar diagonalplus-semiseparable one by means of orthogonal similarity transformations. This makes such a diagonal-plus-semiseparable representation a good alternative to the tridiagonal one when solving dense linear algebra problems. For symmetric tridiagonal matrices there have been developed different homotopy eigensolvers. We present a homoto...
متن کاملImplementation of the Orthogonal QD Algorithm for Lower Tridiagonal Matrices
The orthogonal qd algorithm with shifts (oqds algorithm), proposed by von Matt, is an algorithm for computing the singular values of bidiagonal matrices. This algorithm is accurate in terms of relative error, and it is also applicable to general triangular matrices. In particular, for lower tridiagonal matrices, BLAS Level 2.5 routines are available in preprocessing stage for this algorithm. BL...
متن کاملOn the nonnegative inverse eigenvalue problem of traditional matrices
In this paper, at first for a given set of real or complex numbers $sigma$ with nonnegative summation, we introduce some special conditions that with them there is no nonnegative tridiagonal matrix in which $sigma$ is its spectrum. In continue we present some conditions for existence such nonnegative tridiagonal matrices.
متن کاملUpdating the QR decomposition of block tridiagonal and block Hessenberg matrices generated by block Krylov space methods
For MinRes and SymmLQ it is essential to compute the QR decompositions of tridiagonal coefficient matrices gained in the Lanczos process. Likewise, for GMRes one has to find those of Hessenberg matrices. These QR decompositions are computed by an update scheme where in every step a single Givens rotation is constructed. Generalizing this approach we introduce a block-wise update scheme for the ...
متن کامل